path path(ol.) =pathological; pathology. n. (pl. paths ) 1.(自然踏成的)路;路径;(马路边上的)人行道;(车子走不过的)小路;(竞走或自行车比赛的)跑道。 2.路线;路程;〔比喻〕(人生的)道路;(思想、行为、生活的)途径,方式。 3.【天文学】道,带。 approach path 【航空】进场航线。 moon's path 【天文学】白道。 path of a total eclipse 【天文学】全蚀带。 a path strewn with roses 撒满玫瑰的道路,安乐的一生。 a beaten path 踏出来的[走惯的]路;常规,普通方法。 break [blaze] a (new) path 开辟一条(新)路。 cross sb.'s path 碰见某人;挡住某人去路,阻碍某人。 set sb.on the right path 使某人走上正路。 path-breaker 开路人;闯将。 adj. -less 无路的,人迹未到的。
At the bottom of the page , enter the forward routing path figure 15 在页面底部,输入转发路由路径(图15 ) 。
. transfer the suburban outgoing traffic volume to the new routing path ( 2 )该端局的市郊去话量割到新的路由上。
In order to improve the routing paths , the refinements of routing are studied preliminarily 为改善布线结果,本文对自动布线的优化方法进行了初步的理论研究。
Destinations can be linked to each other by means of configuration , effectively creating a routing path that messages follow 可以通过配置将目的地彼此链接在一起,从而有效地创建消息遵循的路由路径。
This is done using the forward routing path of the inbound service destination , which can be declaratively set in the admin console 使用入站服务的转发路由路径来完成这一步,可以通过声明的方式在管理控制台进行设置:
The alternative is to create a separate queue destination , assign the inbound service to that destination , and set the forward routing path of that inbound service destination to the outbound service destination 也可选择创建一个单独的队列目的地,将入站服务指派给该目的地,并将该入站服务目的地转发路由路径置于出站服务目的地。
It includes the host and router model implementations of the mces . at present , the host model implementation contains the following functions : the host can correctly send and receive the user datagram protocols ( udp ) datagrams and the transmission control protocol ( tcp ) datagrams ; the datagrams could through the correct routing paths crossing different networks ; hosts can communicate via either serial or network adapter 目前主机模型已得到较好完成,实现了如下功能:主机能够发送无连接类型和有连接类型的数据报文;主机能够正确接收无连接类型和有连接类型的数据报文;支持多个应用程序,支持串口通信和网卡通信。
The paper will study the upper questions based on the two interconnection networks . first , we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second , with the rapid progress in vlsi , the failing probability of processors and links is very low , the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary , we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time , the result is the same as the hypercube . we also give a related algorithm in o ( n ) time , and the length of the longest path ; third , we apply cluster faun tolerance introduced by q . - p 根据menger定理, n -维交叉立方体可以容纳n - 1个故障顶点,我们给出了它的时间复杂度为o ( n )的容错路由选择算法及其最长路径长度分析;在此基础上本文证明, n -维交叉立方体的条件连通度为2n - 2 ( n 2 ) ,并给出了相应时间复杂度为o ( n )的算法及其最长路径长度;除此之外,本文还证明当n -维交叉立方体中的故障簇个数不大于n - 1 ,其直径不大于1 ,故障顶点总数不超过2n - 3 ( n 2 )时,交叉立方体中任两个无故障顶点都至少有一条可靠路径。
A differentiated routing algorithm is proposed to route network traffic based on rdm bandwidth allocation model . advertising rdm model parameters and bandwidth utilization statics , different routing path is computed and established for different traffic class by using corresponding logical view of network . it is shown that diffroute can improve service quality in differentiated network effectly while improving resource utilization 提出一种多路区分路由算法:针对区分服务网络中存在的“类间效应” ,以rdm链路带宽分配模型为基础,通过为不同类负载计算不同的传输通路,区分路由可以在确保资源分配公平性的基础上有效改善各类网络负载的分布状况,提高区分服务网络的服务质量; 4